0-efficient Triangulations of 3-manifolds

نویسندگان

  • WILLIAM JACO
  • HYAM RUBINSTEIN
چکیده

0-efficient triangulations of 3-manifolds are defined and studied. It is shown that any triangulation of a closed, orientable, irreducible 3-manifold M can be modified to a 0-efficient triangulation orM can be shown to be one of the manifolds S3,RP3 or L(3, 1). Similarly, any triangulation of a compact, orientable, irreducible, ∂-irreducible 3-manifold can be modified to a 0-efficient triangulation. The notion of a 0-efficient ideal triangulation is defined. It is shown if M is a compact, orientable, irreducible, ∂-irreducible 3-manifold having no essential annuli and distinct from the 3-cell, then ◦ M admits an ideal triangulation; furthermore, it is shown that any ideal triangulation of such a 3-manifold can be modified to a 0-efficient ideal triangulation. A 0-efficient triangulation of a closed manifold has only one vertex or the manifold is S and the triangulation has precisely two vertices. 0-efficient triangulations of 3-manifolds with boundary, and distinct from the 3-cell, have all their vertices in the boundary and then just one vertex in each boundary component. As tools, we introduce the concepts of barrier surface and shrinking, as well as the notion of crushing a triangulation along a normal surface. A number of applications are given, including an algorithm to construct an irreducible decomposition of a closed, orientable 3-manifold, an algorithm to construct a maximal collection of pairwise disjoint, normal 2-spheres in a closed 3-manifold, an alternate algorithm for the 3-sphere recognition problem, results on edges of low valence in minimal triangulations of 3-manifolds, and a construction of irreducible knots in closed 3-manifolds. The first author was partially supported by NSF Grants DMS9704833 and DMS9971719, The Grayce B. Kerr Foundation, The American Institute of Mathematics (AIM), and The Visiting Research Scholar Program at University of Melbourne (Australia). The second author was partially supported by The Australian Research Council, The Grayce B. Kerr Foundation, Stanford University and The American Institute of Mathematics (AIM). Received 06/09/2003.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : 0 90 3 . 01 12 v 1 [ m at h . G T ] 2 8 Fe b 20 09 Coverings and Minimal Triangulations of 3 – Manifolds

This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space L(4k,2k − 1) and the generalised quaternionic space S/Q4k have complexity k, where k ≥ 2. Moreover, it is shown that their minimal triangulations are unique. AMS ...

متن کامل

Layered - Triangulations of 3 – Manifolds

A family of one-vertex triangulations of the genus-g-handlebody, called layered-triangulations, is defined. These triangulations induce a one-vertex triangulation on the boundary of the handlebody, a genus g surface. Conversely, any one-vertex triangulation of a genus g surface can be placed on the boundary of the genus-g-handlebody in infinitely many distinct ways; it is shown that any of thes...

متن کامل

A ug 2 01 2 ON THE CONNECTIVITY OF MANIFOLD GRAPHS

This paper is concerned with lower bounds for the connectivity of graphs (one-dimensional skeleta) of triangulations of compact manifolds. We introduce a structural invariant b∆ for simplicial d-manifolds ∆ taking values in the range 0 ≤ b∆ ≤ d − 1. The main result is that b∆ influences connectivity in the following way: The graph of a d-dimensional simplicial compact manifold ∆ is (2d− b∆)-con...

متن کامل

ar X iv : 0 80 5 . 11 44 v 3 [ m at h . C O ] 1 8 M ay 2 00 9 f - Vectors of 3 - Manifolds

In 1970, Walkup [46] completely described the set of f -vectors for the four 3manifolds S3, S2×S1, S2×S1, and RP . We improve one of Walkup’s main restricting inequalities on the set of f -vectors of 3-manifolds. As a consequence of a bound by Novik and Swartz [35], we also derive a new lower bound on the number of vertices that are needed for a combinatorial d-manifold in terms of its β1-coeff...

متن کامل

Geometric triangulations and discrete Laplacians on manifolds

2 Euclidean structures 3 2.1 Basic definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Weighted triangulations . . . . . . . . . . . . . . . . . . . . . . . 4 2.3 Thurston triangulations . . . . . . . . . . . . . . . . . . . . . . . 5 2.4 Duality triangulations . . . . . . . . . . . . . . . . . . . . . . . . 6 2.5 Equivalence of metric triangulations . . . . . . . . . . . . ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002